Genetic Algorithms for the Single Source Capacitated Location Problem: a Computational Study

In the Single Source Capacitated Location Problem (SSCLP) a set I = {1, .., n} of possible plant locations, each with a maximum capacity ai, i ∈ I, and a set J = {1, ..,m} of customers, each with a demand bj , j ∈ J , are given. It is required to choose a subset of plants and to fully assign each customer to one of the chosen plants, in such a way that the total cost is minimized, and the plant capacities are not exceeded. Total cost is composed by fixed costs, fi, i ∈ I, whenever plant i is open, and by the cost of assigning each customer to one plant, cij , i ∈ I, j ∈ J . Considering xij = { 1, if customer j is assigned to plant i 0, otherwise and yi = { 1, if plant i is open 0, otherwise the SSCLP can be formulated as follows: